Augmenting Undirected Edge Connectivity in Õ(n2) Time
نویسندگان
چکیده
We give improved randomized (Monte Carlo) algorithms for undirected edge splitting and edge connectivity augmentation problems. Our algorithms run in time ~ O(n2) on n-vertex graphs, making them an ~ (m=n) factor faster than the best known deterministic ones on m-edge graphs.
منابع مشابه
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities
We present new edge splitting-off results maintaining all-pairs edge-connectivities of an undirected graph. We first give an alternate proof of Mader’s theorem, and use it to obtain a deterministic Õ(m + rmax · n2)-time complete edge splitting-off algorithm for unweighted graphs, where rmax denotes the maximum edge-connectivity requirement. This improves upon the best known algorithm by Gabow b...
متن کاملAugmenting Edge-Connectivity over the Entire Range in Õ(nm) Time
For a given undirected graph G = (V;E; c G ) with edges weighted by nonnegative reals c G : E ! R + , let G (k) stand for the minimum amount of weights which needs to be added to make G k-edge-connected, and G (k) be the resulting graph obtained from G. This paper rst shows that function G over the entire range k 2 [0;+1] can be computed in O(nm+ n 2 logn) time, and then shows that all G (k) in...
متن کاملFast Augmenting Paths by Random Sampling from Residual Graphs
Consider an n-vertex, m-edge, undirected graph with integral capacities and maxflow value v. We give a new Õ(m + nv)-time maximum flow algorithm. After assigning certain special sampling probabilities to edges in Õ(m) time, our algorithm is very simple: repeatedly find an augmenting path in a random sample of edges from the residual graph. Breaking from past work, we demonstrate that we can ben...
متن کاملEfficient Algorithms for Steiner Edge Connectivity Computation and Gomory-Hu Tree Construction for Unweighted Graphs
We first consider the Steiner edge connectivity problem on an unweighted undirected or Eulerian directed graph with n vertices and m edges. This problem involves finding the edge connectivity of a specified subset S of vertices, i.e. the cardinality of the minimum cut in the graph that separates the vertices in S into two parts. We give a deterministic algorithm for this problem that runs in Õ(...
متن کاملFast edge orientation for unweighted graphs
We consider an unweighted undirected graph with n vertices, m edges, and edge-connectivity 2k. The weak edge orientation problem requires that the edges of this graph be oriented so the resulting directed graph is at least k edge-connected. Nash-Williams proved the existence of such orientations and subsequently Frank [6], Gabow [7], and Nagamochi-Ibaraki [12] gave algorithmic constructions. Al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998